Runtime analysis of ant colony optimization on dynamic shortest path problems
نویسندگان
چکیده
منابع مشابه
Analysis of Ant Colony Optimization for Dynamic Shortest Path Problems
iii Preface This thesis was prepared at the department of Informatics and Mathematical Modelling at the Technical University of Denmark in fulfillment of the requirements for acquiring an M.Sc. in Computer Science and Engineering. It was supervised by associate professor Carsten Witt, and assigned a workload of 30 ECTS credits. The thesis examines how nature-inspired algorithms based on the Ant...
متن کاملRunning time analysis of Ant Colony Optimization for shortest path problems
Ant Colony Optimization (ACO) is a modern and very popular optimization paradigm inspired by the ability of ant colonies to find shortest paths between their nest and a food source. Despite its popularity, the theory of ACO is still in its infancy and a solid theoretical foundation is needed. We present bounds on the running time of different ACO systems for shortest path problems. First, we im...
متن کاملAnt Colony Optimization Revisited from a Randomized Shortest Path Perspective
In this letter, it is shown that the randomized shortest-path framework (RSP, [15]) provides a theoretical interpretation of a class of ant colony optimization (ACO) algorithms, enjoying some nice properties. According to RSP, ants are sent from some initial node until they either eventually reach the goal node, or abandon and come back unsuccessfully along the same path. During their return tr...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملOn Solving Dynamic Shortest Path Problems
Given a dynamic network with n nodes and m arcs in which all attributes including travel times, travel costs and waiting costs may change dynamically over a time horizon T. The dynamic shortest path problem is to determine a path from a specified source node to every other node with minimal total cost, subject to the constraint that the total traverse time is at most T. This problem can be form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.06.035